Beyond the Runs Theorem
نویسندگان
چکیده
In [2], a short and elegant proof was presented showing that a binary word of length n contains at most n − 3 runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length n is at most 22 23 n < 0.957n.
منابع مشابه
TOPOLOGICALLY STATIONARY LOCALLY COMPACT SEMIGROUP AND AMENABILITY
In this paper, we investigate the concept of topological stationary for locally compact semigroups. In [4], T. Mitchell proved that a semigroup S is right stationary if and only if m(S) has a left Invariant mean. In this case, the set of values ?(f) where ? runs over all left invariant means on m(S) coincides with the set of constants in the weak* closed convex hull of right translates of f. Th...
متن کاملOn Runs in Independent Sequences
Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.
متن کاملPhysical Review Letters
Bell’s theorem [1] states that one cannot in general reproduce the results of quantum theory with a classical, deterministic local model. Hardy’s argument of “nonlocality without inequalities” [2] is considered “the best version of Bell’s theorem” [3]. Curiously enough, while in the original proof of Bell’s theorem using inequalities the maximum discrepancy with local models occurs for maximall...
متن کاملAnalyzing Iran’s Local and Regional Droughts Using the Theory of Runs and Standardized Precipitation Index (SPI)
The primary objective of the present study is the investigation of the various properties of Iran’s local and regional droughts based on the theory of runs and standardized precipitation index (SPI). Thus, in order to accomplish this goal, the annual precipitation data of 63 synoptic stations were procured from Iran’s meteorological organization for a 30-year period (1986-2015).. First, based o...
متن کاملFuture directions of automated deduction: Distributed automated deduction
Distributed automated deduction is concerned with the design and realization of strategies where multiple deductive processes work concurrently towards the solution of theorem-proving problems. These strategies are usually implemented in distributed environments, such as a network of computers, or a loosely coupled, asynchronous multiprocessor, where each deductive process runs on a node of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015